True Pareto Fronts for Multi-objective AI Planning Instances
نویسندگان
چکیده
Multi-objective AI planning suffers from a lack of benchmarks with known Pareto Fronts. A tunable benchmark generator is proposed, together with a specific solver that provably computes the true Pareto Front of the resulting instances. A wide range of Pareto Front shapes of various difficulty can be obtained by varying the parameters of the generator. The experimental performances of an actual implementation of the exact solver are demonstrated, and some large instances with remarkable Pareto Front shapes are proposed, that will hopefully become standard benchmarks of the AI planning domain.
منابع مشابه
Evolutionary multi-criteria trajectory modeling of industrial robots in the presence of obstacles
Optimal trajectory planning for robot manipulators is always a hot spot in research fields of robotics. This paper presents two new novel general methods for computing optimal motions of an industrial robot manipulator (STANFORD robot) in presence of obstacles. The problem has a multi-criterion character in which three objective functions, a maximum of 72 variables and 103 constraints are consi...
متن کاملMOEICA: Enhanced multi-objective optimization based on imperialist competitive algorithm
In this paper, a multi-objective enhanced imperialist competitive algorithm (MOEICA) is presented. The main structures of the original ICA are employed while some novel approaches are also developed. Other than the non-dominated sorting and crowding distance methods which are used as the main tools for comparing and ranking solutions, an auxiliary comparison approach called fuzzy possession is ...
متن کاملDerivative-Free Optimization: Lifting Single-Objective to Multi-Objective Algorithm
Most of the derivative-free optimization (DFO) algorithms rely on a comparison function able to compare any pair of points with respect to a blackbox objective function. Recently, new dedicated derivative-free optimization algorithms have emerged to tackle multi-objective optimization problems and provide a Pareto front approximation to the user. This work aims at reusing single objective DFO a...
متن کاملMulti-Criterion Optimization in Minimum Spanning Trees
The Extreme Point Deterministic Algorithm (EPDA), proposed for the multicriterion minimum spanning tree problem, is applicable to more than two criteria and can determine large Pareto fronts comprising of both supported and non-supported efficient solutions, unlike many existing algorithms. EPDA is validated against an exhaustive search for small problems (four to ten nodes, two and three crite...
متن کاملExergy , economy and pressure drop analyses for optimal design of recuperator used in microturbine
The optimal design of a plate-fin recuperator of a 200-kW microturbine was studied in this paper. The exergy efficiency, pressure drop and total cost were selected as the three important objective functions of the recuperator. Genetic Algorithm (GA) and Non-dominated Sorting Genetic Algorithm (NSGA-II) were respectively employed for single-objective and multi-objective optimizations. By opt...
متن کامل